Efficient Genetic Algorithm for Resource Constrained Project Scheduling Problem
نویسندگان
چکیده
منابع مشابه
An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملAn Efficient Simulation Algorithm for Resource-Constrained Project Scheduling Problem
Since Resource-Constrained Project Scheduling Problem (RCPSP) is a well-known NP-hard problem, it is difficult to solve large-scale practical cases by using traditional exact algorithms. Genetic algorithm (GA) is a kind of intelligent algorithm for approximate optimization, which can ascertain global optimization or suboptimal solution within a reasonable time. This article presented a new simu...
متن کاملan efficient genetic algorithm for solving the multi-mode resource-constrained project scheduling problem based on random key representation
in this paper, a new genetic algorithm (ga) is presented for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...
متن کاملAn Improved Genetic Algorithm for Resource Constrained Project Scheduling Problem
Project scheduling with limited resources is a challenging management problem that is of immense importance to both practitioners and researchers. This problem is known to be NP-hard even under the simplifying assumptions of single renewable resource constraint, its constant availability over time and minimization of makespan as objective. This paper presents an improved Genetic Algorithm (GA) ...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2011
ISSN: 1598-4877
DOI: 10.5392/jkca.2011.11.6.059